By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 21, Issue 5, pp. 801-1000

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Increasing the Size of a Network by a Constant Factor can Increase Performance by More Than a Constant Factor

Richard Koch

pp. 801-823

BibTeX  Abstract Full Text:  PDF

Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications

Lin Yu and Daniel J. Rosenkrantz

pp. 824-855

BibTeX  Abstract Full Text:  PDF

A Lower Bound for Parallel String Matching

Dany Breslauer and Zvi Galil

pp. 856-862

BibTeX  Abstract Full Text:  PDF

Searching for a Mobile Intruder in a Polygonal Region

Ichiro Suzuki and Masafumi Yamashita

pp. 863-888

BibTeX  Abstract Full Text:  PDF

Determinism vs. Nondeterminism in Multiparty Communication Complexity

Danny Dolev and Tomás Feder

pp. 889-895

BibTeX  Abstract Full Text:  PDF

On Threshold Circuits and Polynomial Computation

John H. Reif and Stephen R. Tate

pp. 896-908

BibTeX  Abstract Full Text:  PDF

Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions

Bettina Just

pp. 909-926

BibTeX  Abstract Full Text:  PDF

Laying Out Graphs Using Queues

Lenwood S. Heath and Arnold L. Rosenberg

pp. 927-958

BibTeX  Abstract Full Text:  PDF

Optimal On-Line Simulations of Tree Machines by Random Access Machines

Michael C. Loui and David R. Luginbuhl

pp. 959-971

BibTeX  Abstract Full Text:  PDF

New Results on Dynamic Planar Point Location

Siu Wing Cheng and Ravi Janardan

pp. 972-999

BibTeX  Abstract Full Text:  PDF

Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs

Egon Balas and Jue Xue

p. 1000

BibTeX  Abstract Full Text:  PDF